A classification of minimal standard-path 2 × 2 switching networks

2 The Minimal Supersymmetric Standard Model

We consider the sparticle spectra that arise when anomaly mediation is the source of supersymmetry-breaking and the tachyonic slepton problem is solved by a Fayet-Iliopoulos D-term. We also show how this can lead to a minimal viable extension of anomaly mediation, in which the gauge symmetry associated with this D-term is broken at very high energies, leaving as its footprint in the low energy ...

On Minimal Modulo 2 Sums of Products for Switching Functions

Path Switching in OBS Networks

We investigate the concept of path switching in optical burst switched (OBS) networks and its potential to reducing the overall burst drop probability. With path switching, each source maintains a list of alternate paths to each destination, and uses information regarding the recent congestion status of the network links to rank the paths; it then transmits bursts along the least congested path...

O ct 2 00 2 Classification of scale free networks

While the emergence of a power law degree distribution in complex networks is intriguing, the degree exponent is not universal. Here we show that the betweenness centrality displays a power-law distribution with an exponent η which is robust and use it to classify the scale-free networks. We have observed two universality classes with η ≈ 2.2(1) and 2.0, respectively. Real world networks for th...

Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System

In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...